E¢ cient Repeated Implementation II: Incomplete Information
نویسندگان
چکیده
This paper extends Lee and Sabourian [14] and examines repeated implementation of a social choice function in a general incomplete information environment where agents are in nitely-lived and their preferences are determined stochastically in each period. Our main result establishes how any e¢ cient social choice function can be repeatedly implemented in Bayesian Nash equilibrium. Neither incentive compatibility nor (Bayesian) monotonicity is necessary for repeated implementation. JEL Classi cation: A13, C72, C73, D78
منابع مشابه
E¢ cient Repeated Implementation I: Complete Information
This paper examines repeatedly implementing a social choice function in a general complete information environment where agents are in nitely-lived and their preferences are determined stochastically in each period. We rst demonstrate a necessary role that e¢ ciency plays for repeated implementation. We then establish how any e¢ cient social choice function can be repeatedly implemented in Nas...
متن کاملCrout Versions of ILU for General Sparse Matrices
This paper presents an e cient implementation of incomplete LU (ILU) factorizations that are derived from the Crout version of Gaussian elimination (GE). At step k of the elimination, the k-th row of U and the k-th column of L are computed using previously computed rows of U and columns of L. The data structure and implementation borrow from already known techniques used in developing both spar...
متن کاملIncomplete Cholesky Parallel Preconditioners with Selective Inversion
Consider the solution of a large linear system when the coe cient matrix is sparse, symmetric, and positive de nite. One approach is the method of \conjugate gradient" (CG) with an incomplete Cholesky (IC) preconditioner (ICCG). A key problem with the design of a parallel ICCG solver is the bottleneck posed by repeated parallel sparse triangular solves to apply the preconditioner. Our work conc...
متن کاملComplexity Tailored Design: A New Design Methodology for Databases With Incomplete Information
This paper introduces a new design methodology, Complexity Tailored Design, for databases containing incomplete information. The novelty of the approach is that it introduces query complexity as a consideration in database design. In general, the problem of evaluating queries in databases with incomplete information is intractable. Complexity Tailored Design consists in setting the values of da...
متن کاملInformation and Timing in Repeated Bargaining∗
We study a repeated version of the Myerson-Satterthwaite bilateral bargaining problem with serially correlated types. We show that effi cient, unsubsidized, and individually rational trade is possible if and only if the expected dynamic virtual surplus from the effi cient allocation is positive. Using this condition, we study the effects of discounting, frequency of interaction and persistence ...
متن کامل